Rankings of Graphs
نویسندگان
چکیده
A vertex (edge) coloring φ : V → {1, 2, . . . , t} (φ′ : E → {1, 2, . . . , t}) of a graph G = (V,E) is a vertex (edge) t-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The vertex ranking number χr(G) (edge ranking number χ′ r (G)) is the smallest value of t such that G has a vertex (edge) t-ranking. In this paper we study the algorithmic complexity of the Vertex Ranking and Edge Ranking problems. It is shown that χr(G) can be computed in polynomial time when restricted to graphs with treewidth at most k for any fixed k. We characterize the graphs where the vertex ranking number χr and the chromatic number χ coincide on all induced subgraphs, show that χr(G) = χ(G) implies χ(G) = ω(G) (largest clique size), and give a formula for χ′ r (Kn).
منابع مشابه
Comparing rankings by means of competitivity graphs: structural properties and computation
In this paper we introduce a new technique to analyze families of rankings focused on the study of structural properties of a new type of graphs. Given a finite number of elements and a family of rankings of those elements, we say that two elements compete when they exchange their relative positions in at least two rankings. This allows us to define an undirected graph by connecting elements th...
متن کاملOptimal edge ranking of complete bipartite graphs in polynomial time
An edge ranking of a graph is a labeling of edges using positive integers such that all paths connecting two edges with the same label visit an intermediate edge with a higher label. An edge ranking of a graph is optimal if the number of labels used is minimum among all edge rankings. As the problem of finding optimal edge rankings for general graphs is NP-hard [12], it is interesting to concen...
متن کاملMinimal k-rankings for prism graphs
We determine rank numbers for the prism graph P 2 ×C n (P 2 being the connected two-node graph and C n a cycle of length n) and for the square of an even cycle.
متن کاملWorld Rankings of Iranian Anesthesia Research
مقاله از نوع نامه به سردبیر است و نامه به سردبیرها فاقد چکیده هستند.
متن کاملOn vertex rankings of graphs and its relatives
A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must contain a vertex of a higher rank. In this paper we study a relaxation of this notion, in which the requirement above should only hold for paths of some bounded length l for some fixed l. For instance, already the case l =...
متن کاملOptimal Data Collection for Improved Rankings Expose Well-Connected Graphs
Given a graph where vertices represent alternatives and arcs represent pairwise comparison data, the statistical ranking problem is to find a potential function, defined on the vertices, such that the gradient of the potential function agrees with the pairwise comparisons. Our goal in this paper is to develop a method for collecting data for which the least squares estimator for the ranking pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 11 شماره
صفحات -
تاریخ انتشار 1998